Abducing through negation as failure: stable models within the independent choice logic

نویسنده

  • David Poole
چکیده

The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics characterised by independent choices and an ac yclic logic program that specifies the consequences of these choices. This paper gives an abductive characterization of the ICL. The ICL is defined model-theoretically, but we show that it is naturally abductive: the set of explanations of a proposition g is a concise description of the worlds in which g is true. We give an algorithm for computing explanations and show it is sound and complete with respect to the possible-worlds semantics. What is unique about this approach is that the explanations of the negation of g can be deri ved from the explanations of g . The use of probabilities over choices in this framework and going beyond acyclic logic programs are also discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting the Rule Structure for Decision Making within the Independent Choice Logic

Thanks to Craig Boutilier for valuable discussions and for comments on earlier versions of this paper .-minimax search procedure for trees containing chance nodes. [Poole, 1993a] D. Poole. Logic programming, abduction and probability: A top-down anytime algorithm for computing prior and posterior probabilities. [Poole, 1995a] D. Poole. Abducing through negation as failure: Stable models within ...

متن کامل

A New Perspective on Stable Models

The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming (including disjunctive rules, choice rules and conditional literals) and, unlike the original definition,...

متن کامل

Computing Stable Models by Using the ATMS

An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stable models of logic programs are closely connected to stable expansions of a class of autoepistemic theories, this algorithm points to a link between stable expansions of a class of autoepistemic theories and ATMS struct...

متن کامل

How Complicated is the Set of Stable Models of a Recursive Logic Program?

In Logic Programming, ”negation as failure” has become an important area of research. ”Negation as failure” is ubiquitous in deductive databases ([Minker, 1987]), in truth maintenance systems ([Doyle, 1979]), and in default logic ([Reiter, 1980]). It is a naturally occurring “non-monotonic logic”. The original (breadth-first) PROLOG is a (monotonic) classical logic of pure Horn clauses. There, ...

متن کامل

Stable Models Are Generated by a Stable Chain

We propose a general preference criterion selecting thèintended' models of generalized logic programs which a) is a conservative extension of the stable model semantics for normal logic programs of GL88], b) is very close to the answer set semantics of GL91] for disjunctive logic programs, and c) allows for arbitrary formulas in the body and in the head of a rule, i.e. does not depend on the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Program.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2000